450A - Jzzhu and Children - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;

void solve(){
    int n;
    float m;
    cin>>n>>m;
    int a[n];
    int max=-1;
    int maxpos =0;
    for(int i=0;i<n;i++){
        cin>>a[i];
        if(ceil(a[i]/m)>=max){
            max = ceil(a[i]/m);
            maxpos = i;
        }
    }
    cout<<maxpos+1;
}
int main(){
    long long int t;
    //cin>>t;
    t=1;
    while(t--){
        solve();
    }

}